Algebraic techniques for enumerating self-avoiding walks on the square lattice
نویسندگان
چکیده
منابع مشابه
Enumeration of self-avoiding walks on the square lattice
We describe a new algorithm for the enumeration of self-avoiding walks on the square lattice. Using up to 128 processors on a HP Alpha server cluster we have enumerated the number of self-avoiding walks on the square lattice to length 71. Series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and mean-square distance of monomers from the end points h...
متن کاملSelf-avoiding polygons on the square lattice
We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective constant μ = 2.638 158 529 27(1) (biased) and the critical exponent α = 0.500 0005(10) (unbiased). The critical point is indistinguishable from a root of the polyno...
متن کاملSquare lattice walks avoiding a quadrant
In the past decade, a lot of attention has been devoted to the enumeration of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear transformation). But what about walks in non-convex cones? We investigate the two most natural cases: first, square lattice walks avoiding the negative quadran...
متن کاملSelf-avoiding random walks on lattice strips.
A self-avoiding walk on an infinitely long lattice strip of finite width will asymptotically exhibit an end-to-end separation proportional to the number of steps. A proof of this proposition is presented together with comments concerning an earlier attempt to deal with the matter. In addition, some unproved, yet "obvious," conjectures concerning self-avoiding walks are cited as basic propositio...
متن کاملEnumerating Up-Side Self-Avoiding Walks on Integer Lattices
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. Though mathematicians have studied saws for over fifty years, the number of n-step saws is unknown. This paper examines a special case of this problem, finding the number of nstep “up-side” saws (ussaws), saws restricted to moving up and sideways. It presents formulas for the number of n-step ussa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 1993
ISSN: 0305-4470
DOI: 10.1088/0305-4470/26/7/012